Sorting n Objects with a K-Sorter
نویسندگان
چکیده
A k-sorter is a device that sorts k objects in unit time. We deene the complexity of an algorithm that uses a k-sorter as the number of applications of the k-sorter. In this measure, the complexity of sorting n objects is between n log n=k log k and 4n log n=k log k, up to rst order terms in n and k.
منابع مشابه
Design, Development and Evaluation of an Orange Sorter Based on Machine Vision and Artificial Neural Network Techniques
ABSTRACT- The high production of orange fruit in Iran calls for quality sorting of this product as a requirement for entering global markets. This study was devoted to the development of an automatic fruit sorter based on size. The hardware consisted of two units. An image acquisition apparatus equipped with a camera, a robotic arm and controller circuits. The second unit consisted of a robotic...
متن کاملA hardware sort - merge system
A hardware sort-merge system which can sort large files rapidly is proposed. It consists of an initial sorter and a pipelined merger. In the initial sorter, record sorting is divided into two parts: key-pointer sorting and record rearranging. The pipelined merger is composed of several intelligent disks each of which has a simple processor and some buffers. The hardware sortmerge system can sor...
متن کاملImplementation of the Sorting Schemes in a Programmable Logic
Experiments at the Large Hadron Collider (LHC) at CERN require a sophisticated multilevel trigger systems for data selection. At the Compact Muon Solenoid (CMS) experiment, the main task of Level 1 Trigger is to reduce the frequency of events from 40MHz down to 100kHz [1]. There are three major muon subsystems at the CMS: Cathode Strip Chambers (CSC), Drift Tubes (DT), and Resistive Plate Chamb...
متن کاملSorting drops and cells with acoustics: acoustic microfluidic fluorescence-activated cell sorter.
We describe a versatile microfluidic fluorescence-activated cell sorter that uses acoustic actuation to sort cells or drops at ultra-high rates. Our acoustic sorter combines the advantages of traditional fluorescence-activated cell (FACS) and droplet sorting (FADS) and is applicable for a multitude of objects. We sort aqueous droplets, at rates as high as several kHz, into two or even more outl...
متن کاملLarge [ G,d] Sorting Networks
With only a few exceptions the minimum-comparator N-sorter networks employ the generalized "divide-sort-merge" strategy. That is, the N inputs are divided among g 2 2 smaller sorting networks -of size N1’N2’...‘Ng9 where N = g ck~1 Nk -that comprise the initial portion of the N-sorter network. The remainder of the N-sorter is a comparator network that merges the outputs of the Nl-, N2-, . . . ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Computers
دوره 39 شماره
صفحات -
تاریخ انتشار 1990